Partial matchings induced by morphisms between persistence modules
نویسندگان
چکیده
We study how to obtain partial matchings using the block function Mf, induced by a morphism f between persistence modules. Mf is defined algebraically and linear with respect direct sums of morphisms. some interesting properties provide way obtaining matrix operations.
منابع مشابه
Antimatroids Induced by Matchings
An antimatroid is a combinatorial structure abstracting the convexity in geometry. In this paper, we explore novel connections between antimatroids and matchings in a bipartite graph. In particular, we prove that a combinatorial structure induced by stable matchings or maximumweight matchings is an antimatroid. Moreover, we demonstrate that every antimatroid admits such a representation by stab...
متن کاملInduced matchings and the algebraic stability of persistence barcodes
We define a simple, explicit map sending a morphism f : M → N of pointwise finite dimensional persistence modules to a matching between the barcodes of M and N . Our main result is that, in a precise sense, the quality of this matching is tightly controlled by the lengths of the longest intervals in the barcodes of ker f and coker f . As an immediate corollary, we obtain a new proof of the alge...
متن کاملMorphisms of Certain Banach C*-modules
Morphisms and representations of a class of Banach C*-modules, called CQ*algebras, are considered. Together with a general method for constructing CQ*-algebras, two different ways of extending the GNS-representation are presented.
متن کاملMatchings Avoiding Partial Patterns
We show that matchings avoiding a certain partial pattern are counted by the 3Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on the corresponding oscillating tableaux. We also find a bijection between matchings avoiding both patterns 12312 and 121323 and Schröder paths without peaks at level one, which are counted by the super-Catalan numbers or...
متن کاملMatchings and Partial Patterns
A matching of size 2n is a partition of the set [2n] = {1, 2, . . . , 2n} into n disjoint pairs. A matching may be identified with a canonical sequence, which is a sequence of integers in which each integer i ∈ [n] occurs exactly twice, and the first occurrence of i precedes the first occurrence of i+ 1. A partial pattern with k symbols is a sequence of integers from the set [k], in which each ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry: Theory and Applications
سال: 2023
ISSN: ['0925-7721', '1879-081X']
DOI: https://doi.org/10.1016/j.comgeo.2023.101985